Systems and methods for creating a universal record

ABSTRACT

A method for tracking multiple classes of records in a single blockchain is disclosed. Class identifiers can used for each record entry to distinguish between classes within the blockchain.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of U.S. application Ser.No. 16/338,982, filed Apr. 2, 2019, which is a 371 patent application ofInternational Application No. PCT/US2017/059744, filed Nov. 2, 2017,which is a non-provisional application of and claims the benefit of thefiling date of U.S. Provisional Application No. 62/416,957, filed onNov. 3, 2016, which are herein incorporated by reference in theirentirety for all purposes.

BACKGROUND

New technologies are improving systems for record keeping. For example,blockchain technology provides self-referencing and cryptographicallysecure records that are safe from tampering. However, it can becumbersome to create and implement secure record keeping systems, suchas blockchains. As a result, blockchain systems are often not createdunless there is the high chance of the data tampering or therecord-keeper has abundant disposable resources. Accordingly, many typesof records remain insecure.

Embodiments of the invention address these and other problemsindividually and collectively.

SUMMARY

Embodiments of the invention provide systems and methods for combiningmultiple blockchain systems into a single blockchain system. Forexample, separate types of information, such as medical information,academic achievement information, employee data, access rights,financial transactions, and any other suitable information can all berecorded in a single blockchain. As a result, the effort used to createblockchain record systems is reduced, as several disparate systems canbe consolidated into one. Additionally, classes of information thatmight not have previously had their own blockchains can now be easilyincorporated into a universal blockchain.

The universal blockchain can distinguish between different types ofrecorded information by including a class identifier in each entry. Thisallows different types of information to be recorded together in ablockchain while still maintaining distinct and intelligible ledgers.Class identifiers can also be uniquely assigned to each node, such thata node's permission for contributing information to a specific recordclass can be verified by the presence of a valid class identifier.

One embodiment of the invention is directed to a method. The methodcomprises receiving, by an administrative node computer, a request for aclass identifier for a certain class from a first node computer. Therequest includes an address identifier associated with the first nodecomputer. The method further includes generating the class identifierand creating an association between the class identifier and the addressidentifier. The method also comprises receiving a data element from thefirst node computer. The data element includes the address identifier,the class identifier, and record update information. The method furtherincludes verifying that the class identifier is associated with theaddress identifier, verifying that the record update information ispermitted according to the class identifier, and then creating a blockfor a blockchain, the block including the first data element.

Another embodiment of the invention is directed to an administrativenode computer configured to perform the above-described method.

Another embodiment of the invention is directed to a method comprisingsending, by a first node computer, a request for a class identifier fora certain class to an administrative node computer. The requestincluding an address identifier associated with the first node computer,and the administrative node computer generates the class identifier andcreates an association between the class identifier and the addressidentifier. The method further includes receiving the class identifierfrom the administrative node computer, generating a data elementincluding the address identifier, the class identifier, and recordupdate information, and sending the data element to the administrativenode computer. The administrative node computer verifies that the classidentifier is associated with the address identifier. The administrativenode computer also verifies that the record update information ispermitted according to the class identifier. The administrative nodecomputer then creates a block for a blockchain, the block including thefirst data element.

Another embodiment of the invention is directed to a first node computerconfigured to perform the above-described method.

Further details regarding embodiments of the invention can be found inthe Detailed Description and the Figures.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a block diagram of a system according to an embodiment ofthe invention.

FIG. 2 shows a block diagram of an administrative node computer,according to an embodiment of the invention.

FIG. 3 shows a block diagram of a first node computer, according to anembodiment of the invention.

FIG. 4 shows a diagram of data tags of multiple types associated with asingle participant, according to an embodiment of the invention.

FIG. 5 shows an example of a block in a blockchain, according to anembodiment of the invention.

FIGS. 6A-6C shows a flow diagram illustrating a method for creating ablockchain that combines multiple types of information, according toembodiments of the invention.

DETAILED DESCRIPTION

Embodiments of the present invention are directed to utilizing a singleblockchain for multiple types of information. For example, medicalpatient information, biometric data, ownership data, academiccredentials, product data, employee achievement information, financialtransactions, etc. can all be recorded in a single blockchain. Thedifferent sets of information can be distinguished by including a classidentifier in each blockchain entry.

For example, embodiments include submitting a data element including newinformation, and having a class identifier in each data element. Theclass identifiers serve to distinguish, for example, a transaction usingUS dollars from a transaction using Japanese yen. Each blockchain in theblock can include multiple data elements, each data element beingassociated with a specific class. A complete ledger for a specific class(e.g., transaction conducted using US dollars) can be compiled byretrieving all data elements associated with that class from the totalblockchain.

Additionally, embodiments of the invention provide additional securityand trust in the blockchain by incorporating several verified and linkedidentifiers. For example, a node computer that submits a new dataelement can include an address identifier, an issuance identifier, and aclass identifier in the data element. Each of these identifiers can beuniquely associated with the node and assigned by a trusted, centraladministrator. If the identifiers are not all used together, a dataelement may be rejected.

Further, the node's class identifier may only be used for a specificclass that the node is authorized for updating. For example, the nodemay be authorized to issue digital assets based on a US dollar value,but not a British pound value. Before recording a new data element inthe blockchain, an administrative node may verify that a classidentifier is being used appropriately, that it is accompanied by thecorrect address identifier and issuance identifier, and that thesubmitting node has not exceeded a daily spending limit for that class.As a result, if a first node submits a digital asset (e.g., a dataelement that promises a value transfer), other nodes can be confidentthat the submitting node has been cleared to issue a digital asset forthat specific currency, that the administrator has verified the currentuse of the class identifier, that a number of other verification stepshave taken place, and that therefore a new digital asset is trustworthyand reliable.

Additional features that can be included in embodiments of the inventionare described in the International Application US2017/046364, which isincorporated by reference herein in its entirety for all purposes.

Prior to discussing specific embodiments of the invention, some termsmay be described in detail.

An “address identifier” may include an identifier for a participant. Forexample, an address identifier can represent a node or a serviceprovider in a network. In some embodiments, a communication can bedirected to a specific node by including the node's address identifier.An address identifier can include a string of characters, such asletters, numbers, etc. For example, an address identifier can be astring of 5, 10, 15, or any other suitable number of characters. In someembodiments, a public key associated with a participant can be used asthe participant's address identifier.

An “issuance identifier” may include an identifier indicating thatpermission is issued. For example, an issuance identifier can serve asevidence that a network participant is authorized to submit newinformation (e.g., create new data elements for a record). An issuanceidentifier can include a string of characters, such as letters, numbers,etc. For example, an address identifier can be a string of 5, 10, 15, orany other suitable number of characters.

A “class identifier” may include a value that represents a specific typeof record. Class identifiers can be used to identify any suitable classof recordable information. For example, a class identifier can beconfigured to identify medical information-type records, academiccredential-type records, product identifier-type records, employeedata-type records, value transfer records of various types (e.g., USdollar payments, British pound payments, Chinese yuan payments, digitalright data transfers, property deed transfers, event ticket transfers,game credit transfers, energy credit transfers, mobile phone minutetransfers, etc.), or any other suitable type of record. Classes can bedivided in any suitable manner. For example, product identifier recordscan be further divided into a food product class, an office suppliesclass, an electronic products class, etc.

In some embodiments, a class identifier can also indicate that aspecific participant is authorized to create and/or receive dataelements for that type of record. For example, a first class identifiercan indicate that a first node has permission to submit and/or receivedigital assets associated with a US dollar value, and a second classidentifier can indicate that a second node has permission to update apublic health record. Multiple class identifiers can be assigned to asingle node or service provider, each class identifier indicating acertain class of record that the node is authorized to update. A classidentifier can include a string of characters, such as letters, numbers,etc. For example, an address identifier can be a string of 5, 10, 15, orany other suitable number of characters.

An “enterprise identifier” may include an identifier for a user. Forexample, an enterprise identifier can be a globally unique identifierfor an end user that submits new record information to a node in arecord-keeping network, or for an end user that receives informationabout new record information (e.g., a value transfer) from a node. Insome embodiments, an enterprise identifier can also indicate a specificnode with which a user is associated. Additionally, an enterpriseidentifier can be valid for use with a specific class of record. Anenterprise identifier may include alphanumeric characters, specialcharacters, and any other suitable symbol.

A “data element” may refer to digital information. For example, a dataelement can be information that exists in binary format. In someembodiments, a data element can include information about anything thatcan be described in a record. For example, a data element can includeany suitable type of digital information, such as medical data,biometric data, ownership data, academic credentials, product data, etc.A data element can also be used to describe an update, a change, or arequest. For example, a data element can include digital informationabout a change in a person's medical status, an update about the numberof sick days an employee has used, a request to validate or approve of avalue transfer, or a promise to transfer a value from one entity toanother. One example of a data element is a digital asset.

A “digital asset” may refer to digital content associated with a value.In some cases, the digital asset may also indicate a transfer of thevalue. For example, a digital asset may include data that indicates atransfer of a currency value (e.g., fiat currency or crypto currency).In other embodiments, the digital asset may correspond to othernon-currency values, such as access privileges data (e.g., a number ofauthorized usages, a time allotment for accessing information, eventtickets, login credentials, etc.), ownership data (e.g., digital rightdata, a property deed, vehicle ownership credentials, etc.), and usagecredit data (e.g., game credit, energy credits, mobile phone minutes,etc.)

The term “node” may refer to a connection point. In some embodiments, anode may be a physical electronic device that is capable of creating,receiving, or transmitting data. In other embodiments, a node may be asoftware module on a computing device, the software module a connectionpoint in a communication network. In some embodiments, a node may be acomputing device within a record-keeping network. A node may be able tocreate a data element, transfer a data element, receive a data element,validate a data element, access a central record, and/or perform anyother suitable functions. Different types of nodes may be able toperform different sets of functions within a recording network. In someembodiments, a node may be associated with and/or operated by afinancial institution computer (e.g., a bank), a payment processorcomputer, a third party computer, or any other suitable entity.

A “record” may refer to evidence of a data element. A digital record canbe electronic documentation of a data element. A record can include arecord identifier and record information. For example, recordinformation can include information a data element (e.g., a digitalasset) and/or information about the data element (e.g., a digitalsignature associated with the digital asset). A record identifier can bea number, title, or other value used for identifying a record. A recordidentifier can be nondescript, in that it may not provide any meaningfulinformation about the record information in the record. Examples ofrecords include medical records, academic records, transaction recordswithin a ledger of transactions, etc. Another example of a record is ablock in a blockchain. An individual block can be an individual record,and a blockchain can be a series of records. A blockchain header is anexample of a record identifier, and a blockchain body is an example ofrecord information.

The term “ledger of transactions” may refer to a compilation of datafrom previous transactions. The ledger of transactions may be a databaseor other comparable file structure that may be configured to store datafrom all previous digital asset transfers, including the date and timeof the transfer, the transfer amount, and identification information forthe participants of the transfer (e.g., the sender and the receiver ofthe transfer amount). In some embodiments, the ledger of transactionsmay be in the form of an electronic ledger (e.g., blockchain) in whichdata already stored in the electronic ledger is unalterable.

As used herein, a “blockchain” may comprise a series of blocks. Eachblock in the blockchain may include an electronic record of one or morehistorical transactions, as well as metadata. In some embodiments,blocks in the blockchain can be linked by including a reference to theprevious block (e.g., a hash output of a previous block). Each new blockin the blockchain may be algorithmically determined based on newtransactions and previous blocks in the blockchain. As a result, anytampering of data stored in these previous blocks can be detected.

A “key pair” may include a pair of linked encryption keys. For example,a key pair can include a public key and a corresponding private key. Ina key pair, a first key (e.g., a public key) may be used to encrypt amessage, while a second key (e.g., a private key) may be used to decryptthe encrypted message. Additionally, a public key may be able toauthenticate a digital signature created with the corresponding privatekey. The public key may be distributed throughout a network in order toallow for authentication of messages signed using the correspondingprivate key. Public and private keys may be in any suitable format,including those based on RSA or elliptic curve cryptography (EGG). Insome embodiments, a key pair may be generated using an asymmetric keypair algorithm. However, a key pair may also be generated using othermeans, as one of ordinary skill in the art would understand.

The term “digital signature” may refer to an electronic signature for amessage. A digital signature may be a numeric value, an alphanumericvalue, or any other type of data including a graphical representation. Adigital signature may be a unique value generated from a message and aprivate key using an encrypting algorithm. In some embodiments, avalidation algorithm using a public key may be used to validate thesignature.

A “server computer” may include a powerful computer or cluster ofcomputers. For example, the server computer can be a large mainframe, aminicomputer cluster, or a group of servers functioning as a unit. Inone example, the server computer may be a database server coupled to aWeb server. The server computer may be coupled to a database and mayinclude any hardware, software, other logic, or combination of thepreceding for servicing the requests from one or more client computers.

FIG. 1 shows a system 100 comprising a number of components. The system100 comprises a recording network that is administered by anadministrative node computer 150. The first node computer 165, thesecond node computer 145, and any other suitable number of nodecomputers participate in the network. The first user computer 110operated by a first user (not shown) can submit record updateinstructions via the first node computer 165, and the second usercomputer 130 operated by a second user (not shown) can receive recordupdates via the second node computer 145. All of the computers shown inthe system 100 may be in operative communication with each other throughany suitable communication channel or communications network. Suitablecommunications networks may be any one and/or the combination of thefollowing: a direct interconnection; the Internet; a Local Area Network(LAN); a Metropolitan Area Network (MAN); an Operating Missions as Nodeson the Internet (OMNI); a secured custom connection; a Wide Area Network(WAN); a wireless network (e.g., employing protocols such as, but notlimited to a Wireless Application Protocol (WAP), I-mode, and/or thelike); and/or the like.

Messages between the computers, networks, and devices may be transmittedusing a secure communications protocols such as, but not limited to,File Transfer Protocol (FTP); HyperText Transfer Protocol (HTTP); SecureHypertext Transfer Protocol (HTTPS), Secure Socket Layer (SSL), ISO(e.g., ISO 8583) and/or the like.

The system 100 can be configured to maintain multiple types of recordsvia a single recording network. The administrative node computer 150 canadministrate the record-keeping process by providing a number services.For example, the administrative node computer 150 can build new blocksfor a blockchain, the new blocks including updated record information.The administrative node computer 150 can also enroll nodes and endusers, as well as regulate the behavior of participating nodes in orderto keep the records secure and reliable. The administrative nodecomputer 150 can further verify new data elements and informparticipating nodes about new data elements and blocks.

While the administrative node computer 150 can build and maintain therecords, the first node computer 165 and the second node computer 145can submit new information to the administrative node computer 150 forrecording. The first node computer 165 and the second node computer 145can do this by creating and submitting data elements of various classes.The first node computer 165 and the second node computer 145 can createdata elements based on information received from the first user computer110 and/or the second user computer 130.

While FIG. 1 specifically illustrates the first node computer 165 andthe second node computer 145, the system 100 can include any suitablenumber of additional node computers (as represented by the empty circlesin FIG. 1 ). Additionally, the first node computer 165 and second nodecomputer 145 can communicate with other user computers beyond the firstuser computer 110 and the second user computer 130. Further, the system100 can include more than one administrative node computer 150 foradministering the recording network.

The system 100 may be used to process, approve, and record any suitabletype of information. For example, the system 100 can be used to recorddata elements with new medical patient data, new academic achievements,new value transfers, etc. Further, the system 100 can maintain multipletypes of information in a single blockchain record.

An example of an administrative node computer 150, according to someembodiments of the invention, is shown in FIG. 2 . The administrativenode computer 150 comprises a processor 150A, a network interface 150B,a record database 150C, a node database 150D, a user database 150P, akey database 150Q, and a computer readable medium 150E.

The record database 150C can store records. For example, data elementsreceived from nodes in the network can be inserted into a record andstored in the record database 150C. In some embodiments, the records cantake the form of a blockchain with block records, each block includingone or more data elements.

The node database 150D can include information about nodes, such as thefirst node computer 165 and the second node computer 145. For example,the node database can include identifiers associated with the first nodecomputer 165, such as an address identifier, an issuance identifier, andone or more class identifiers. The node database 150D can also includeinformation about restrictions associated with different nodes. Forexample, the node database 150D can store a spending limit (e.g.,$400,000 a day) associated with a first class identifier (e.g., for USdollars) of the first node computer 165, as well as a spending limit(e.g., 700,000 a week) associated with a second class identifier (e.g.,for Chinese yuan) of the first node computer 165. The node database 150Dcan also include information about progress toward the spending limits(e.g., $56,832 remaining for US dollars).

The user database 150P can include information about enrolled end users,such as the first user and the second user, as well as devicesassociated with the users (e.g., the first user computer 110 and thesecond user computer 130). This can include enterprise identifiers, aswell as information about which node the user is associated. Forexample, the second user computer's enterprise identifier can beassociated with the second node computer's address identifier, as wellas a specific class identifier and issuance identifier.

The key database 150Q can store encryption keys. For example, the keydatabase 150Q can include a public key for each node, as well as aprivate key associated with the administrative node computer 150. Insome embodiments the key database 150Q can take the form of a hardwaresecurity module (HSM).

The computer readable medium 150E may comprise an enrolling module 150F,permission module 150G, tracking module 150H, validation module 150J, asigning module 150K, a record update module 150L, a settlement module150M, and any other suitable software module. The computer readablemedium 150E may also comprise code, executable by the processor 150A forimplementing a method comprising receiving from a first node computer, arequest for a class identifier for a certain class, the requestincluding an address identifier associated with the first node computer;generating the class identifier; creating an association between theclass identifier and the address identifier; receiving a data elementfrom the first node computer, the data element including the addressidentifier, the class identifier, and record update information;verifying that the class identifier is associated with the addressidentifier; verifying that the record update information is permittedaccording to the class identifier; and creating a block for ablockchain, the block including the first data element.

The enrolling module 150F may comprise code that causes the processor150A to enroll node computers for joining the recording network. Forexample, the enrolling module 150F may contain logic that causes theprocessor 150A to evaluate whether or not an entity can enroll, as wellas what level of risk to assign to a new entity. A risk level can beaffected by whether the entity is a well-known and reliableorganization, whether it has established a settlement account or othersettlement processes, whether it is located in a risky country, etc. Inaddition to assigning a risk level, the administrative node computer 150can issue activity limits for the node based on the risk profile.Activity limits can include, for example, maximum transaction thresholdlimits and/or velocity limits, such as a limit on the number of digitalassets or total digital asset value that can be submitted within acertain time period (e.g., a day, a week, or a month).

The enrolling module 150F may also include instructions for generatingand assigning a unique address identifier for a newly enrolled node.Additionally, there may be instructions for generating and distributingkeys to a newly enrolled node. For example, the administrative nodecomputer 150 may generate a key pair for a node. The administrative nodecomputer 150 can store the public key and provide the private key to thenode computer.

The enrolling module 150F can further include instructions for enrollingend users. For example, the administrative node computer 150 can receiveinformation about a new user (e.g., a name, address, account number,phone number, a business' corporate profile, etc.) from a node, storethe user information, and then assign a unique enterprise identifier tothe user. In some embodiments, the enterprise identifier can include asubset of characters that are indicative of the associated node or thenode's address identifier.

The permission module 150G may comprise code that causes the processor150A to assign permissions to nodes. For example, the permission module150G may contain logic that causes the processor 150A to generate andassign an issuance identifier to a node computer (e.g., based on ananalysis of a risk profile). The issuance identifier can serve as proofthat a node computer is generally authorized to create and submit and/orreceive data elements.

The permission module 150G can also, in conjunction with the processor150A, generate and assign one or more class identifiers to a nodecomputer. Each class identifier can be associated with a limit. Forexample, the first node computer 165 can be issued a class identifierindicating that the first node computer 165 can submit data elements forupdating medical patient information, but the first node computer 165may be limited to using this class identifier at most five times a day.

The permission module 150G further include instructions for associatingall of the node's identifiers and restrictions. For example, the firstnode computer's address identifier, issuance identifier, first classidentifier, second class identifier, and class restrictions can all belinked and stored in the node database 150D.

The tracking module 150H may comprise code that causes the processor150A to track and monitor class restrictions. For example, the trackingmodule 150H may contain logic that causes the processor 150A to sum thetotal transaction amount (e.g., $597) or number of transactions (e.g., 4transactions) submitted by the first node computer 165 for a given class(e.g., US dollars) within a given time period (e.g., 1 week). If thefirst node computer 165 submits a new digital asset that exceeds aspecified limit for the class (e.g., $1000 US dollars per week), thetracking module 150H can, in conjunction with the processor 150A, rejectthe digital asset, issue a warning, and/or place a temporary hold onfirst node computer's activities.

FIG. 4 shows a visual representation of the information that theadministrative node computer 150 generates, stores, and tracks for eachnode computer. This information can be stored in the node database 150D.While FIG. 4 shows information associated with a single node computer,the administrative node computer 150 can maintain this type ofinformation for each node computer.

As shown in FIG. 4 , the administrative node computer 150 recognizes aspecific node computer based on a unique address identifier. A uniqueissuance identifier can accompany the address identifier for eachsubmitted data element. Several class identifiers for different classesof data elements (e.g., US dollar transfers, medical record updates,mobile phone minute transfers, academic achievement record updates, andBritish pound transfers) can be associated with the address identifierand issuance identifier. Restrictions for each class identifier can benoted, and the usage of each class identifier can be monitored such thatthe remaining usage can be tracked.

Referring back to FIG. 2 , the validation module 150J may comprise codethat causes the processor 150A to validate a new data element so thatthe data element can be entered in the records. For example, thevalidation module 150J may contain logic that causes the processor 150Ato check that the data element includes an address identifier, anissuance identifier, and a class identifier that are all valid andassociated with the same node computer. The validation module 150J canalso include instructions to check that limits associated with thesubmitted class identifier have not been exceeded and are not currentlybeing exceeded by the new data element.

The validation module 150J may further contain logic that causes theprocessor 150A to verify that all entities associated with the dataelement (e.g., one or more nodes, and one or more users) are registeredwith the network and have been screened for compliance. Theadministrative node computer 150 can also evaluate transaction risk, forexample by assessing the transaction velocity of one or more partiesinvolved, or by determining whether the submitting node has any warningsissued.

The validation module 150J may further comprise code that causes theprocessor 150A to verify the authenticity of a digital signature. Forexample, the validation module 150J may contain logic that causes theprocessor 150A to use the node computer's public key to verify theauthenticity of a digital signature associated with that node computer.

The signing module 150K may comprise code that causes the processor 150Ato generate digital signatures. For example, the signing module 160K maycontain logic that causes the processor 150A to generate a digitalsignature for a data element using an administrative node private key.The administrative node computer's digital signature can serve toindicate the authenticity of a data element, and can provide a guaranteethat a transfer is valid and trustworthy. In some embodiments, theadministrative node computer's digital signature can be considered acosigning of the digital asset, indicating that the administrative nodecomputer 150 will deliver a promised value to the recipient if the payordoes not deliver. Further, the digital signature can activate a smartcontract that holds the first node computer 165 liable for the sendingamount in the originating currency. For example, a smart contract canautomatically initiate a settlement process after a certain amount oftime. In some embodiments, the administrative node computer 150 canforce settlement between a two accounts at a central bank.

The record update module 150L may comprise code that causes theprocessor 150A to maintain and update a set of records. For example, therecord update module 150L may contain logic that causes the processor150A to record information about a new data element. In someembodiments, the record update module 150L may include instructions forincluding a new data element in the next block in a blockchain.

The record update module 150L may further include instructions for, whena new data element is created, informing the parties associated with thedata element. For example, when a new digital asset is validated andsigned, the administrative node computer 150 may send information aboutthe new digital asset to a receiving node (e.g., the second nodecomputer 145) and/or the user computers.

In some embodiments, the participating node computers may not maintain aseparate set of records, and may instead refer to thecentrally-maintained records of the administrative node computer 150.For example, the first node computer 165 and the second node computer145 may each be light nodes. In such a case, the administrative nodecomputer 150 may provide these nodes with real-time access to thecentral records, or the administrative node computer 150 may provideregular record updates (e.g., updates can be sent every 10 seconds, 1minute, 5 minutes, etc.). As a result, other nodes may be aware of newdata elements immediately or soon after the data elements are recorded.

In some embodiments, participating node computers may not be able to seeall of the record information, and they may instead have a filtered orpermissioned view of the records. For example, the first node computer165, the second node computer 145, the first user computer 110, and/orthe second user computer 130 may only be able to view data elements withwhich they are associated (e.g., transactions to which they are a party)when accessing the records at the administrative node computer 150. Forexample, the second node computer 145 may be able to view all blockheaders, but may only be able to view block bodies and data elementswith which it is associated.

In some embodiments, there may be multiple administrative node computers150 that each receive and process different data elements, and thenupdate their own records. These different administrative node computersmay communicate with one another to share new records and to confirmthat their records have the same data elements.

The settlement module 150M may comprise code that causes the processor150A to settle a promised value between accounts. For example, thesettlement module 150M may contain logic that causes the processor 150Ato debit the first node's settlement account at a central bank by anamount indicated in a data element, and to credit the second node'ssettlement account with that same amount (or that amount less assessedfees).

In some embodiments, the settlement module 150M can include instructionsfor converting from a first currency to a second currency duringsettlement. This can be accomplished by, for example, separating thesettlement transaction into two separate transactions. The firstsettlement transaction can include debiting the first node's account bya first amount in a first currency (e.g., US dollars), and thencrediting a first account of the central bank (e.g., a US dollaraccount) by the same amount with the same type of currency. The secondsettlement transaction can include debiting a second account of thecentral bank (e.g., a Chinese yuan account) by a second amount in asecond currency (e.g., Chinese yuan), and then crediting the secondnode's account by the same amount with the same type of currency (e.g.,Chinese yuan).

Referring back to FIG. 1 , the first node computer 165 can, as mentionedabove, participate in the recording network by creating and submittingnew data elements for updating the records on behalf of one or moreusers.

An example of a first node computer 165, according to some embodimentsof the invention, is shown in FIG. 3 . The first node computer 165comprises a processor 165A, a network interface 165B, an identifierdatabase 165C, a progress database 165D, a key database 165E, and acomputer readable medium 165F.

The identifier database 165C can store information about the first nodecomputer's identifiers, such as an address identifier, an issuanceidentifier, and one or more class identifiers. The identifier database165C may also include information about one or more users, such as anenterprise identifiers, an associated class type, and/or a user account.

The progress database 165D can include information about classrestrictions and/or progress toward those restrictions. In someembodiments, the identifier database 165C and the progress database 165Dcan include the information described above with respect to FIG. 4 .

The key database 165E can store encryption keys. For example, the keydatabase 165E can include a private key associated with the first nodecomputer 165, as well as a public key associated with the administrativenode computer 150. In some embodiments the key database 165E can takethe form of a hardware security module (HSM).

The computer readable medium 165F may comprise an enrollment module165G, a permission module 165H, a progress module 165J, a user enrollmodule 165K, a data element module 165L, a node lookup module 165M, avalue analysis module 165N, a signing module 165P, a record submissionmodule 165Q, and any other suitable software module. The computerreadable medium 165F may also comprise code, executable by the processor165A for implementing a method comprising sending a request for a classidentifier for a certain class to an administrative node computer, therequest including an address identifier associated with the first nodecomputer, wherein the administrative node computer generates the classidentifier and creates an association between the class identifier andthe address identifier; receiving the class identifier from theadministrative node computer; generating a data element including theaddress identifier, the class identifier, and record update information;and sending the data element to the administrative node computer,wherein the administrative node computer verifies that the classidentifier is associated with the address identifier, wherein theadministrative node computer verifies that the record update informationis permitted according to the class identifier; and wherein theadministrative node computer creates a block for a blockchain, the blockincluding the first data element.

The enrollment module 165G may comprise code that causes the processor165A to enroll with the administrative node computer 150 forparticipation in the recording network. For example, the enrollmentmodule 165G may contain logic that causes the processor 165A to send anenrollment request message including information about the first node,such as an address, a bank identifier, a settlement account, and/or anyother suitable information. The enrollment module 165G also includeinstructions for receiving and storing an address identifier, anadministrative node public key, a first node private key, and any othersuitable enrollment information from the administrative node computer150.

The permission module 165H may comprise code that causes the processor165A to obtain permission for creating and submitting data elements. Forexample, the permission module 165H may contain logic that causes theprocessor 165A to send a permission request message to theadministrative node computer 150, the message indicating one or morespecific record classes. The permission module 165H can also includeinstructions for receiving and storing permission data, such as anissuance identifier, one or more class identifiers, and informationabout class restrictions.

The progress module 165J may comprise code that causes the processor165A to track and monitor progress toward class restrictions. Forexample, the progress module 165J may contain logic that causes theprocessor 165A to sum the total number of data elements issued for eachclass over their specified time periods, the total amount of currencypromised for each class over their specified time periods, or otherwisetrack spending limits (e.g., by updating the progress database 165D). Insome embodiments, the first node computer 165 may not proceed withcreating a data element requested by the first user computer 110 if thedata element would cause a limit to be exceeded.

The user enroll module 165K may comprise code that causes the processor165A to facilitate enrollment of end users. For example, the user enrollmodule 165K may contain logic that causes the processor 165A to provideuser information (e.g., a name, a residential and/or business address, adate of birth, a phone number, an account number, an account username,an account password, an email address, a government-issuedidentification number such as a driver's license number, passportnumber, or social security number, etc.) to the administrative nodecomputer 150. The first node computer 165 can also receive and store anenterprise identifier for the first user computer 110 from theadministrative node computer 150, and provide the enterprise identifierto the first user computer 110.

The data element module 165L may comprise code that causes the processor165A to generate a new data element. For example, the data elementmodule 165L may contain logic that causes the processor 165A to receivea request from the first user computer 110, and to create a data elementbased on the request.

The node lookup module 165M may comprise code that causes the processor165A to identify a node based on a user. For example, the node lookupmodule 165M may contain logic that causes the processor 165A to identifythe second node computer based on the second user computer beingindicated as a digital asset recipient. For example, the second node'saddress identifier may be identified based on a subset of charactersincluded in the second user's enterprise identifier, or the addressidentifier can be associated with the second user's enterpriseidentifier in a database (e.g., a database accessed at theadministrative node computer 150). The node lookup module 165M can alsoinclude instructions for adding an identified address identifier to anew data element.

The value analysis module 165N may comprise code that causes theprocessor 165A to determine a value for a digital asset. For example,the value analysis module 165N may contain logic that causes theprocessor 165A to determine a first amount in a first currency that willbe charged to the first user computer 110 in order to deliver a secondamount in a second currency to the second user computer 130. Thisdetermination can include looking up a current foreign exchange rate andcalculating transfer fees (e.g., both of which can be provided by theadministrative node computer 150). The amount debited in the firstcurrency, the amount credited in the second currency, the currencyexchange rate, and/or the fees assessed can be included in a new digitalasset.

The signing module 165P may comprise code that causes the processor 165Ato create a digital signature. For example, the signing module 165P maycontain logic that causes the processor 165A to apply a private key anda mathematical algorithm to a data element, such that the digitalsignature is generated for the data element.

The record submission module 165Q may comprise code that causes theprocessor 165A to submit a new data element for recording. For example,the record submission module 165Q may contain logic that causes theprocessor 165A to send a new data element, an associated digitalsignature, and/or any other suitable information to the administrativenode computer 150.

In some embodiments, the first node computer 165 can provide additionalservices to a user beyond submitting new data elements in the recordingnetwork. For example, the first node computer 165 can be a computerassociated with a financial institution, a hospital, a governmentagency, an academic institution, a mobile phone service provider, or anyother suitable service provider. Accordingly, in some embodiments, thefirst node computer 165 can maintain an account on behalf of the user.The account may store identity information, medical records, academicrecords, financial information, or any other suitable details dependingon the type of service provider.

In embodiments where the first node computer 165 is associated with afinancial institution, the first node computer 165 may store value onbehalf of the user. The first node computer 160 may also be able toprovide value (e.g., provide a payment) on behalf of the user. Anexample of a financial institution is an issuer, which may typicallyrefer to a business entity (e.g., a bank) that issues and maintains anaccount (e.g., a bank account) for a user.

In some embodiments, the first node computer 165 can be representativeof multiple associated computers. For example, the functionalitydescribed above for network participation and the functionalityassociated with banking services can be divided among severalcooperative computers.

Referring back to FIG. 1 , the second node computer 145 can, asmentioned above, participate in the recording network. In someembodiments, the second node computer 145 can validate the authenticityof a new digital asset (or other data element), and can inform thesecond user computer 130 about the new information.

The second node computer 145 can validate that a new data element isauthentic in one or more manners. For example, the second node computer145 can verify that the first node computer's digital signature and theadministrative node computer's signature are both authentic (e.g., usingtheir respective public keys).

The second node computer 145 can also verify that a valid classidentifier is used for the data element. Verifying that there is anauthentic class identifier can serve as additional evidence that theadministrative node computer 150 has enrolled and authenticated thefirst node computer 165 for issuing data elements for this specificcurrency (or other record class), and that therefore the new dataelement can be trusted.

Further, the second node computer 145 can confirm that an incoming dataelement is of a class that the second node computer 145 is approved toreceive. For example, the second node computer 145 can be associatedwith a unique address identifier, a unique issuance identifier, and oneor more unique class identifiers, and the second node computer 145 canconfirm that it has an appropriate class identifier proving it isauthorized to receive the data element.

In some embodiments, the second node computer 145 can verify theauthenticity of a data element by accessing a central record (e.g., ablockchain record), and confirming that the data element has been addedto the records.

The second node computer 145 is primarily described herein as a nodethat receives a new data element on behalf of the second user computer130. However, in some embodiments, the second node computer 145 caninclude some or all of the functionality described above with respect tothe first node computer 165. For example, the second node computer 145can submit new data elements to the recording network on behalf of thesecond user computer 130 or other associated users. Similarly, in someembodiments, the first node computer 165 can include some or all of thefunctionality described with respect to the second node computer 145(e.g., the first node computer 165 can receive and validate dataelements on behalf of the first user computer 110).

Similar to the first node computer 165, the second node computer 145 canalso be associated with a service provider such as a bank. As a result,the second node computer 145 can host a second user account, and canstore and receive a value on behalf of the second user. As an examplethe second node computer 145 can be associated with an acquirer, whichmay typically be a business entity (e.g., a commercial bank) that has abusiness relationship with a particular resource provider or otherentity. Some entities can perform both issuer and acquirer functions.Some embodiments may encompass such single entity issuer-acquirers.

In some embodiments, second node computer 145 may have a high-level oftrust that a value promised via a digital asset will be delivered, forexample because of two valid digital signatures, because of the dataelement being included in a blockchain record, because of the dataelement including several associated identifiers (e.g., a classidentifier, an issuance identifier, and/or an address identifier), orbecause of any other suitable evidence. As a result, the second nodecomputer 145 may make a value indicated in a received digital assetimmediately usable (e.g., withdrawable) in the second user's account,even if the value has not yet been settled and received.

As explained above, multiple nodes can join the recording network, andeach node can send and receive data elements on behalf of multipleusers. A user can be an individual, a business, an organization'srecord-updating administrator, or any other suitable type of user. Forexample the first user can be an individual, and the second user can bea resource provider (e.g., a merchant) that engages in transactions andcan sell goods or services, or provide access to goods or services.

In some embodiments, an end user can be associated with multipleenterprise identifiers. For example, a different enterprise identifiermay be assigned to a user for each different currency and bank withwhich the user is associated. The first user can have multiple accountsat the first node computer 165, each with a different currency.Accordingly, the first user computer 110 can store a differententerprise identifier for each type of currency used with the first nodecomputer 165. The first user may also engage in transactions usinganother account at a separate bank node, and may have another enterpriseidentifier associated with this additional bank.

As mentioned above, in some embodiments, the recording system mayutilize a blockchain. Each block in the blockchain may includeinformation about one or more data elements. A blockchain ledger may beunalterable without detection. For example, each block may include adata header that includes a hash of the previous block in the blockchainledger and a root value of all past transactions. Since each block inthe blockchain ledger may be generated in a similar manner by includinga data header storing information referencing its previous entry andprevious transactions, no entry can be modified without affecting allfollowing entries. This ensures that any tampering of informationrelated to transactions, such as an attempt to reassign a digital assetto an inappropriate entity, will not go unnoticed. Together, a blockheader and a block body that includes the transaction information (e.g.,and any other suitable information) can make up a block.

By incorporating class identifiers that indicate what type ofinformation is being recorded, a single blockchain can be used forrecording multiple classes of information. For example, a singleblockchain include information about payment transactions of variouscurrencies, information about other value transfers, medicalinformation, academic information, employee information, etc.

FIG. 5 shows an example of the information stored in a blockchain block.The example Block B is expanded to show some of the information in BlockB. This example block includes three data elements and a hash header.Each data element includes information describing how a ledger (or otherdata set) is being updated.

For example, the data element 1 can include information about the nodethat submitted the data element (e.g., the first node computer 165).This can include the first node's address identifier, issuanceidentifier, class identifier, digital signature, and public key.

Data element 1 can also include information about the involved endusers, such as an enterprise identifier associated with the user (e.g.,the first user computer 110) that provided the new information to thefirst node. In embodiments where the data element is a digital asset,the digital asset can include information about a digital assetrecipient. The recipient (e.g., the second user computer 130) can beidentified by a second enterprise identifier.

Data element 1 further includes the record update information. Forexample, this can be new medical information, new academic achievementinformation, new employee information, or information about a newpayment transaction (e.g., $50 is being sent from the first user to thesecond user). In some embodiments, in addition to the class identifier,data element 1 can also include a simple indication of the class type ofthe data element (e.g., US dollars).

As the administrative node computer 150 can validate and approve of thedata element, data element 1 can include the administrative nodecomputer's digital signature. Data element 1 can also includeinformation about the receiving node (e.g., where the data element isused for a value transfer with a recipient). This can include an addressidentifier, an issuance identifier, and/or a class identifier. Further,each data element can include a unique data element identifier (e.g., atransaction identifier).

Embodiments allow data elements to include any other suitableinformation, such as an administrative node public key, informationabout a sending currency type and amount, a receiving currency type andamount, a currency exchange rate, fee information, an invoice number(e.g., for an invoice sent by the second user computer 130 to the firstuser computer 110), a purchase order number, a timestamp, additionalfirst user information (e.g., an account number, a name, contactinformation), additional second user information, (e.g., an accountnumber, a name, contact information), etc. When the second user receivesa digital asset, the second user computer 130 and second node computer145 may have sufficient information to execute settlement of thetransaction.

As shown in FIG. 5 , the different data elements can optionally beassociated with different classes. Data element 1 may belong to a firstclass, data element 2 may belong to a second class, and data element 3may belong to a third class. As an example, the first class can indicatethat data element 1 is a digital asset issued to transfer currency in USdollars, the second class can indicate that data element 2 is a digitalasset issued to transfer currency in British pounds, and the third classcan indicate that data element 3 is submitted to provide informationabout a new academic achievement (e.g., a Master's degree is beingawarded to a specific person).

Embodiments allow the block to include additional information beyond thedata elements, such as a reference to a previous block (e.g., a previousblock header), a timestamp, a random number, a hash of recordinformation, etc.

A method 600 according to embodiments of the invention can be describedwith respect to FIGS. 6A-6C. Some elements in other Figures are alsoreferred to. The steps shown in the method 600 may be performedsequentially or in any suitable order in embodiments of the invention.In some embodiments, one or more of the steps may be optional.

The various messages described below may use any suitable form ofcommunication. In some embodiments, a request or response may be in anelectronic message format, such as an e-mail, a short messaging service(SMS) message, a multimedia messaging service (MMS) message, a hypertexttransfer protocol (HTTP) request message, a transmission controlprotocol (TCP) packet, a web form submission. The request or responsemay be directed to any suitable location, such as an e-mail address, atelephone number, an internet protocol (IP) address, or a uniformresource locator (URL). In some embodiments, a request or response maycomprise a mix of different message types, such as both email and SMSmessages.

At step S101, the first node computer 165 sends a registration requestmessage to the administrative node computer 150. The registrationrequest message may include information about the first node computer165 (e.g., an address, an organization name, a bank identifier) and/orany other suitable information. The registration request can alsorequest permission to act as a node and send and/or receive dataelements.

At step S102, the administrative node computer 150 enrolls the firstnode computer 165 for participation in the recording network. Theadministrative node computer 150 can perform risk analysis to verifywhether the first node computer 165 is sufficiently trustworthy toparticipate in the recording network. The administrative node computer150 can then issue an address identifier for the first node computer165. The administrative node computer 150 may also assign an issuanceidentifier for the first node computer 165 at this point. The issuanceidentifier may be linked with the address identifier, such that it isonly valid when accompanied by the address identifier.

The administrative node computer 150 may store information about thefirst node computer 165 (e.g., the address identifier and associatedissuance identifier), and send a registration response message to thefirst node computer 165 indicating that the first node computer 165 issuccessfully enrolled. The response message can include the addressidentifier and issuance identifier.

At this point, the administrative node computer 150 may also provide anysuitable software (e.g., a software development kit) to the first nodecomputer 165 for interacting with the recording network.

At step S103, the first node computer 165 sends a class request messageto the administrative node computer 150. The class request message canbe used to request the ability to create data elements of a specificclass. For example, the first node computer 165 can request permissionfor submitting digital assets for sending value to a recipient, wherethe digital asset will be settled using US dollars. The first nodecomputer 165 can request permission for creating any other suitableclass of data element, such as data elements with updated medicalinformation, data elements with information about new academiccredentials, and digital assets for paying with another asset class(e.g., Japanese yen, bitcoin, mobile phone minutes, etc.).

At this point, or at any other suitable time, the first node computer165 can also establish a settlement account at a central bank (e.g., abank administered by the administrative node computer 150), or otherwiseestablish settlement agreements (e.g., using a correspondent bank thathas a central settlement account). The first node computer 165 canindicate, in the class request message, that a settlement account hasbeen established for the desired currency class.

At step S104, the administrative node computer 150 can issue one or moreclass identifiers for the first node computer 165. The administrativenode computer 150 may first determine whether or not to issue a classidentifier for the first node computer 165, for example based on a riskprofile and whether or not a settlement pathway has been established.The class identifier can provide the first node computer 165 with theability to create data elements of the specified class. For example, thefirst node computer 165 can now be able to successfully create andsubmit a digital asset with a US dollar value if an appropriate classidentifier is provided. In some embodiments, the class identifier canboth identify a specific class and the specific node, such that only thefirst node computer 165 can use the class identifier.

Having fully enrolled and obtained an address identifier, an issuanceidentifier, and a class identifier, the first node computer 165 canfacilitate the enrollment of end users. The first user may desire to usethe recording network, and may use the first user computer 110 tocommunicate a request for enrollment to the first node computer 165, aswell as a type of currency that the first user would like to use fortransactions.

At step S105, the first node computer 165 can send a registrationrequest message to the administrative node computer 150 on behalf of thefirst user. The first node computer 165 can provide any suitableinformation about the first user to the administrative node computer150, such as a name, address, organization information, payment accountinformation (e.g., a balance, and a currency type), a credit score, etc.The first node computer 165 can also identify itself by providing anaddress identifier, issuance identifier, and/or class identifier withthe request message. The class identifier can indicate the currencyclass with which the user wishes to transact.

At step S106, the administrative node computer 150 can determine whetherto enroll the first user (e.g., based on a risk profile). Theadministrative node computer 150 can also generate and issue anenterprise identifier for the first user computer 110. In someembodiments, the enterprise identifier can only be used for a certainrecord class and for data elements submitted by the first node computer165. For example, the administrative node computer 150 can storeinformation specifying that the enterprise identifier is specificallyassociated with the first node computer's address identifier, issuanceidentifier, and/or class identifier. Further, in some embodiments, asubset of the enterprise identifier (e.g., 5 characters) can beformatted to indicate an association with the first node computer 165and/or a record class.

The administrative node computer 150 can transmit the first usercomputer's new enterprise identifier back to the first node computer165. Then, at step S107, the first node computer 165 can store theenterprise identifier (e.g., as associated with the first user'saccount) and forward the enterprise identifier to the first usercomputer 110. Having enrolled and obtained an enterprise identifier, thefirst user computer 110 can now initiate the creation and recording ofnew data elements. For example, if the enterprise identifier isassociated with the use of currency, the first user computer 110 can nowsend payments to another user via the blockchain network.

At step S108, the first user computer 110 sends a record request to thefirst node computer 165. For example, the first user computer 110 cansubmit a request for sending a digital asset to the second user computer130 for a payment transaction. The record request can include the firstuser computer's enterprise identifier, the recipient's (e.g., the seconduser computer) enterprise identifier, and record update information fora specific record class. In the payment transaction example, the recordupdate information can comprise an amount and a type of currency to sendto the recipient. For example, the first user may wish to send a paymentof $1000 in Singapore dollars to the second user, but the first user maywish to make the payment from an account with US dollars.

At step S109, the first node computer 165 determines a node associatedwith the second user computer 130, such that the digital asset can beaddressed to that node. For example, the first node computer 165 candetermine the second node computer's address identifier based on thesecond user computer's enterprise identifier.

At step S110, the first node computer 165 creates a data element forupdating the records of the specific class. For example, the first nodecomputer 165 can create a digital asset that promises a payment to thesecond user computer 130, where the monetary value will be sent using USdollars (e.g., the class is USD). The digital asset can also indicatethat the final delivered value (e.g., $1000 SGD), as well as the foreignexchange rate (e.g., 1 USD to 1.3 SGD), the total fees (e.g., $10 USD),and the initial value in US dollars (e.g., $779 USD) that will bewithdrawn from the first user's account.

The data element can includes the first user computer's enterpriseidentifier, the second user computer's enterprise identifier, the recordupdate information, the first node computer's address identifier, thefirst node computer's issuance identifier, the first node computer'sasset identifier, and the second node computer's address identifier.Other information that can be included in the data element is describedabove with respect to FIG. 5 .

In some embodiments, the first node computer 165 can add the second nodecomputer's class identifier to the data element, in addition to thesecond node computer's address identifier. As a result, the data elementcan include two class identifiers; a first class identifier of the firstnode computer 165, and a second class identifier of the second nodecomputer 145. This can be useful for the case where the first nodecomputer 165 is sending the payment using a first currency (e.g., USD)associated with a first class identifier and the second node computer145 is receiving the payment using a second currency (e.g., SGD)associated with a second class identifier. As a result, the two nodescan transact even if they are not both authorized to transact with asame currency class.

At step S111, the first node computer 165 generates a first digitalsignature for the data element. For example, the first node computer 165can generate a one-way hash using some or all of the information in thedata element, and then encrypt hash using a private key. The hash valueand/or digital signature may be attached to the data element, therebymaking the data element data-tampering evident.

At step S112, the first node computer 165 sends the data element and thedigital signature to the administrative node computer 150 for validationand entering into a blockchain record.

At step S113, the administrative node computer 150 can verify that thefirst node computer's class identifier, the first node computer'sissuance identifier, and first node computer's address identifier areall valid and associated with one another and the first node computer165. For example, the administrative node computer 150 can locate theaddress identifier in a node database and confirm that the issuanceidentifier and class identifier are associated with it in the nodedatabase. If any one of the identifiers does not belong with the otheridentifiers, the transaction may be rejected by the administrative nodecomputer 150.

At step S114, the administrative node computer 150 can verify that thedata element has the same class as the class identifier. For example, ifthe data element is a digital asset designed to send a value from anaccount with US dollars, the administrative node computer 150 can verifythat the class identifier is also associated with the use of US dollars.If the class identifier does not match the type of record informationincluded in the data element, the administrative node computer 150 mayreject the data element.

In some embodiments, as mentioned above, a second class identifierassociated with the second node computer 145 can also be included in adigital asset. The administrative node computer 150 can verify thatdigital asset indicates that the final currency type delivered to thesecond node computer 145 (e.g., SGD) matches the class type of thesecond class identifier, or otherwise verify that the second nodecomputer 145 is authorized to receive the payment and currency beingsent.

At step S115, the administrative node computer 150 can validate thefirst node computer's digital signature and/or hash value. For example,the administrative node computer 150 may perform a checksum procedurefor the hash value. This can include generating a second hash valuebased on the digital asset and checking that the second hash valuematches the received hash value. The administrative node computer 150may validate the digital signature using the first node computer'spublic key. Again, the administrative node computer 150 can reject thedata element if the hash or digital signature cannot be validated.

If steps S113-S115 as well as any other suitable verification steps aresuccessfully completed, the administrative node computer 150 canconsider the data element valid and proceed with recording the dataelement. At step S116, the administrative node computer 150 generates asecond digital signature for the data element (e.g., using anadministrative node computer 150 private key).

At step S117, the administrative node computer 150 can add the dataelement to a record. For example, the administrative node computer 150can create a new block for a blockchain, the block including the newdata element (e.g., along with one or more other new data elements).

At step S118, the administrative node computer 150 can send a copy ofthe data element to the second node computer 145. The administrativenode computer 150 can also make the blockchain record accessible to thesecond node computer 145.

At step S119, the second node computer 145 can verify the authenticityof the data element. For example, the second node computer 145 canconfirm that the data element has been entered into the blockchainrecord (e.g., by accessing the blockchain record at the administrativenode computer 150). The second node computer 145 can also verify thatdata element includes two digital signatures; one from the first nodecomputer 165, and one from the administrative node computer 150. Thesecond node computer 145 can also validate the digital signatures (e.g.,using the appropriate public keys). Additionally, the second nodecomputer 145 can verify that the data element includes all theappropriate first node identifiers, and that the class identifiers matchthe indicated currency classes. All of these verifications, incombination, can create a high-level of trust in the authenticity of thedata element. Additionally, the administrative node computer 150 canguarantee that the digital asset value will be delivered, even if aproblem arises with the first node computer 165.

At step S120, the second node computer 145 can update its local recordsbased on the data element. For example, the second node computer 145 cancredit the digital asset's indicated value to the second user's bankaccount. Because there may be a high-level of trust in the digitalasset, the second node computer 145 may credit the second user's accountso that the funds can be withdrawn before the digital asset value issettled between the first node and the second node.

At a later time, the digital asset value can be settled between thefirst node and the second node. For example, batch settlement formultiple digital assets can happen at the end of the day. In someembodiments, settlement can happen in two steps. First, a first valuecan be debited from the first node's settlement account, and the samefirst value can be credited to an administrative node settlementaccount. Second, a second value can be debited from the sameadministrative node settlement account or a different administrativenode settlement account, and the same second value can be credited tothe second node's settlement account. The first value and second valuecan be the same or different (e.g., the second value can be less thanthe first value by one or more fees). Additionally, the first value andthe second value can have different currency types (e.g., the firstvalue can be in USD, and the second value in SGD).

Embodiments of the invention have a number of advantages. For example,in embodiments of the invention, multiple types of information that arenormally separate can be recorded together in a single blockchain.Different types of record information can still be distinguished basedon class identifiers. Accordingly, multiple blockchain systems can becombined, reducing the burden of creating multiple separate blockchainsystems. Additionally, record classes that are typically not in ablockchain (e.g., due to high cost and effort) can now be recorded in auniversal blockchain. As a result, recorded information is made moretamperproof, secure, and trustworthy.

Embodiments of the invention also advantageously more increase thetrustworthiness of a blockchain ledger. A central, trusted administratorcan enroll each node and end user, track participant behavior (e.g.,monitor for unusual activity), and make sure that participants do notexceed spending limits. Additionally, each data element can be digitallysigned by both the submitting node and the administrative node. Theadministrative node can also guarantee a transfer value promised by asending node, and the administrative node can enter a new data elementinto a secure blockchain. As a result, receiving nodes can be sure thata number of safety checks have been completed, that the data elementwill not be erased or changed, and that the data element is thereforelegitimate and trustworthy.

As additional security measures, each node can be assigned threedifferent identifiers. The address identifier can uniquely identify anode, the issuance identifier can be unique evidence that a node isauthorized to create data elements, and a class identifier can be uniqueevidence that a node is authorized to submit data elements associatedwith a specific record class. A data element may only be approved if allthree of these are used together and within their assigned restrictions.As a result, even if one of these identifiers is compromised and usedillegitimately, the illegitimate data element will not succeed becauseit does not include the other two identifiers (e.g., as well as a validdigital signature, etc.). This can give a receiving node extraconfidence that a new data element was legitimately created andsubmitted by the indicated sending node, and that therefore any promisedvalue will be delivered.

A computer system will now be described that may be used to implementany of the entities or components described herein. Subsystems in thecomputer system are interconnected via a system bus. Additionalsubsystems include a printer, a keyboard, a fixed disk, and a monitorwhich can be coupled to a display adapter. Peripherals and input/output(I/O) devices, which can couple to an I/O controller, can be connectedto the computer system by any number of means known in the art, such asa serial port. For example, a serial port or external interface can beused to connect the computer apparatus to a wide area network such asthe Internet, a mouse input device, or a scanner. The interconnectionvia system bus allows the central processor to communicate with eachsubsystem and to control the execution of instructions from systemmemory or the fixed disk, as well as the exchange of information betweensubsystems. The system memory and/or the fixed disk may embody acomputer-readable medium.

As described, the inventive service may involve implementing one or morefunctions, processes, operations or method steps. In some embodiments,the functions, processes, operations or method steps may be implementedas a result of the execution of a set of instructions or software codeby a suitably-programmed computing device, microprocessor, dataprocessor, or the like. The set of instructions or software code may bestored in a memory or other form of data storage element which isaccessed by the computing device, microprocessor, etc. In otherembodiments, the functions, processes, operations or method steps may beimplemented by firmware or a dedicated processor, integrated circuit,etc.

Any of the software components or functions described in thisapplication may be implemented as software code to be executed by aprocessor using any suitable computer language such as, for example,Java, C++ or Perl using, for example, conventional or object-orientedtechniques. The software code may be stored as a series of instructions,or commands on a computer-readable medium, such as a random accessmemory (RAM), a read-only memory (ROM), a magnetic medium such as ahard-drive or a floppy disk, or an optical medium such as a CD-ROM. Anysuch computer-readable medium may reside on or within a singlecomputational apparatus, and may be present on or within differentcomputational apparatuses within a system or network.

While certain exemplary embodiments have been described in detail andshown in the accompanying drawings, it is to be understood that suchembodiments are merely illustrative of and not intended to berestrictive of the broad invention, and that this invention is not to belimited to the specific arrangements and constructions shown anddescribed, since various other modifications may occur to those withordinary skill in the art.

As used herein, the use of “a”, “an” or “the” is intended to mean “atleast one”, unless specifically indicated to the contrary.

What is claimed is:
 1. A method comprising: receiving, by anadministrative node computer, from a first node computer, a first dataelement including first record update information of a first class, afirst class identifier associated with the first class, and a firstaddress identifier associated with the first node computer; verifying,by the administrative node computer, that the first record updateinformation is permitted by determining that the first class identifiermatches the first class of the first record update information;receiving, by the administrative node computer, from a second nodecomputer, a second data element including second record updateinformation of a second class, a second class identifier associated withthe second class, and a second address identifier associated with thesecond node computer, the second class being different than the firstclass; verifying, by the administrative node computer, that the secondrecord update information is permitted by determining that the secondclass identifier matches the second class of the second record updateinformation; and creating, by the administrative node computer, one ormore blocks for a blockchain, the one or more blocks including the boththe first data element and the second data element.
 2. The method ofclaim 1, wherein both the first data element and the second data elementare included in a single block of the blockchain.
 3. The method of claim1, wherein the first data element is included in a first block for theblockchain, and the second data element is included in a second blockfor the blockchain.
 4. The method of claim 1, wherein the blockchainincludes a first plurality of data elements associated with the firstclass, and the blockchain includes a second plurality of data elementsassociated with the second class.
 5. The method of claim 4, wherein eachof the first plurality of data elements associated with the first classincludes the first class identifier, and further comprising: retrieving,from the blockchain, based on the first class identifier, the firstplurality of data elements associated with the first class; andcompiling, using the retrieved first plurality of data elements, acomplete record of information of the first class.
 6. The method ofclaim 1, wherein the blockchain includes a third data element with thirdrecord update information of a third class that is different from thefirst class and the second class, and wherein the blockchain includes afourth data element with fourth record update information of a fourthclass that is different from the first class, the second class, and thethird class.
 7. The method of claim 1, further comprising: verifying, bythe administrative node computer, based on the first address identifier,that the first node computer is authorized to submit the first recordupdate information of the first class; and verifying, by theadministrative node computer, based on the second address identifier,that the second node computer is authorized to submit the second recordupdate information of the second class.
 8. The method of claim 1,wherein the first class is medical information, and wherein the secondclass is access rights information.
 9. The method of claim 1, whereinthe first class is biometric data, and wherein the second class isacademic achievement information.
 10. The method of claim 1, wherein thefirst class is biometric data, and wherein the second class is employeedata.
 11. An administrative node computer comprising: a processor; and acomputer readable medium, the computer readable medium comprising code,executable by the processor, for implementing a method comprising:receiving, from a first node computer, a first data element includingfirst record update information of a first class, a first classidentifier associated with the first class, and a first addressidentifier associated with the first node computer; verifying that thefirst record update information is permitted by determining that thefirst class identifier matches the first class of the first recordupdate information; receiving, from a second node computer, a seconddata element including second record update information of a secondclass, a second class identifier associated with the second class, and asecond address identifier associated with the second node computer, thesecond class being different than the first class; verifying that thesecond record update information is permitted by determining that thesecond class identifier matches the second class of the second recordupdate information; and creating one or more blocks for a blockchain,the one or more blocks including the both the first data element and thesecond data element.
 12. The administrative node computer of claim 11,wherein both the first data element and the second data element areincluded in a single block of the blockchain.
 13. The administrativenode computer of claim 11, wherein the first data element is included ina first block for the blockchain, and the second data element isincluded in a second block for the blockchain.
 14. The administrativenode computer of claim 11, wherein the blockchain includes a firstplurality of data elements associated with the first class, and theblockchain includes a second plurality of data elements associated withthe second class.
 15. The administrative node computer of claim 14,wherein each of the first plurality of data elements associated with thefirst class includes the first class identifier, and the method furthercomprising: retrieving, from the blockchain, based on the first classidentifier, the first plurality of data elements associated with thefirst class; and compiling, using the retrieved first plurality of dataelements, a complete record of information of the first class.
 16. Theadministrative node computer of claim 11, wherein the blockchainincludes a third data element with third record update information of athird class that is different from the first class and the second class,and wherein the blockchain includes a fourth data element with fourthrecord update information of a fourth class that is different from thefirst class, the second class, and the third class.
 17. Theadministrative node computer of claim 11, the method further comprising:verifying, based on the first address identifier, that the first nodecomputer is authorized to submit the first record update information ofthe first class; and verifying, based on the second address identifier,that the second node computer is authorized to submit the second recordupdate information of the second class.
 18. The method of claim 1,wherein the first class is a first type of recordable information, thefirst class identifier identifies the first class, the first classidentifier serves as an indication that the first record updateinformation of the first class is permitted, the second class is asecond type of recordable information, the second class identifieridentifies the second class, and the second class identifier serves asan indication that the second record update information of the secondclass is permitted.
 19. The method of claim 1, wherein the first classis financial transactions of a first currency type, and the second classis financial transactions of a second currency type, the second currencytype being different than the first currency type.
 20. The method ofclaim 19, wherein the first record update information is about a firsttransaction utilizing the first currency type, and wherein the secondrecord update information is about a second transaction utilizing thesecond currency type.